Temporal Aspects-based Replacement in Media Object Caches
نویسندگان
چکیده
Caching is an appropriate and well-known approach for reducing data transmissions in distributed information systems by creating and maintaining redundant data. As cache memory is limited and cached data might get outdated, it is impossible to store everything forever. If a cache is full, a replacement strategy decides on the cache entry that needs to be replaced by new data. There exist various strategies utilising different indicators for making this decision. Almost all of them do not take the content and the context of the systems’ users into account. In this paper, we present two novel cache replacement strategies called TA and aTA that utilize temporal aspects included in media objects such as websites, specified by the user, or learnt from her or his behaviour. Our evaluation results show that, in the used application scenario, TA and aTA outperform classical replacement schemes like LRU.
منابع مشابه
Exploitation of different types of locality for Web caches
Object access distribution in the Web is governed by Zipf’s law, in general. This property leads to effective Web caches, which store the most popular objects and typically employ the LFU replacement policy, which achieves high, and often the highest, cache hit rates. However, Web cache design based only on Zipf’s law has two main disadvantages: (i) it does not exploit the temporal and spatial ...
متن کاملA Comparison of Locality-Based and Recency-Based Replacement Policies
Caches do not grow in size at the speed of main memory or raw processor performance. Therefore, optimal use of the limited cache resources is of paramount importance to obtain a good system performance. Instead of a recency-based replacement policy (such as, e.g., LRU), we can also make use of a locality-based policy, based on the temporal reuse of data. These replacement policies have usually ...
متن کاملModified LRU Policies for Improving Second-Level Cache Behavior
Main memory accesses continue to be a significant bottleneck for applications whose working sets do not fit in second-level caches. With the trend of greater associativity in second-level caches, implementing effective replacement algorithms might become more important than reducing conflict misses. After showing that an opportunity exists to close part of the gap between the OPT and the LRU al...
متن کاملInteractive video streaming with proxy servers
Martin Reisslein Felix Hartanto Keith W. Ross GMD FOKUS Institute Eurecom freisslein, [email protected] [email protected] www.fokus.gmd.de/usr/freisslein, hartantog www.eurecom.fr/~ross Abstract|We study caching strategies for proxies that cache VBR{encoded continuous media objects for highly interactive streaming applications. First, we develop a model for streaming VBR{encoded continuous m...
متن کاملThe Split replacement policy for caches with prefetch blocks
Prefetching is an inbuilt feature of file system and storage caches. The cache replacement policy plays a key role in the performance of prefetching techniques, since a miss occurs if a prefetch block is evicted before the arrival of the on-demand user request for the block. Prefetch blocks display spatial locality, but existing cache replacement policies are designed for blocks that display te...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012